Decomposing Borel functions and structure at finite levels of the Baire hierarchy
نویسندگان
چکیده
منابع مشابه
Decomposing Borel Sets and Functions and the Structure of Baire Class 1 Functions
All spaces considered are metric separable and are denoted usually by the letters X, Y , or Z. ω stands for the set of all natural numbers. If a metric separable space is additionally complete, we call it Polish; if it is a continuous image of ω or, equivalently, of a Polish space, it is called Souslin. The main subject of the present paper is the structure of Baire class 1 functions. Recent de...
متن کاملWhen are Borel functions Baire functions ?
The following two theorems give the flavour of what will be proved. THEOREM. Let Y be a complete metric space. Then the families of first Baire class functions and of first Borel class functions from [0, 1] to Y coincide if and only if Y is connected and locally connected. THEOREM. Let Y be a separable metric space. Then the families of second Baire class functions and of second Borel class fun...
متن کاملthe underlying structure of language proficiency and the proficiency level
هدف از انجام این تخقیق بررسی رابطه احتمالی بین سطح مهارت زبان خارجی (foreign language proficiency) و ساختار مهارت زبان خارجی بود. تعداد 314 زبان آموز مونث و مذکر که عمدتا دانشجویان رشته های زبان انگلیسی در سطوح کارشناسی و کارشناسی ارشد بودند در این تحقیق شرکت کردند. از لحاظ سطح مهارت زبان خارجی شرکت کنندگان بسیار با هم متفاوت بودند، (75 نفر سطح پیشرفته، 113 نفر سطح متوسط، 126 سطح مقدماتی). کلا ...
15 صفحه اولDecomposing Borel Functions Using the Shore-slaman Join Theorem
Jayne and Rogers proved that every function from an analytic space into a separable metrizable space is decomposable into countably many continuous functions with closed domains if and only if the preimage of each Fσ set under it is again Fσ . Many researchers conjectured that the JayneRogers theorem can be generalized to all finite levels of Borel functions. In this paper, by using the Shore-S...
متن کاملCalibrating Determinacy strength in Levels of the Borel Hierarchy
We analyze the set-theoretic strength of determinacy for levels of the Borel hierarchy of the form Σ01+α+3, for α < ω1. Well-known results of H. Friedman and D.A. Martin have shown this determinacy to require α+1 iterations of the Power Set Axiom, but we ask what additional ambient set theory is strictly necessary. To this end, we isolate a family of Π1-reflection principles, Π1-RAPα, whose con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2012
ISSN: 0168-0072
DOI: 10.1016/j.apal.2012.03.004